Location:
Search - shortest path
Search list
Description: 第一章：Internetworking
第二章：Internet Protocols
第三章：IP Subnetting and Variable Length Subnet Masks(VLSM)
第四章：Introduction to the Cisco IOS
第五章：IP路由
第六章：Enhanced IGRP(EIGRP) and Open Shortest Path First(OSPF)
第七章：Layer 2 Switching
第八章：Virtual LANs(VLANs)
第九章：Managing a Cisco Interwork
第十章：Managing Traffic with Access Lists
第十一章：Wide Area Networking Protocols-Chapter I: Internetworking Chapter II: Internet Protocols Chapter III: IP Subnetting and Variable Length Subnet Masks (VLSM) Chapter IV: Introduction to the Cisco IOS Chapter V: IP Routing Chapter VI: Enhanced IGRP (EIGRP) and Open Shortest Path First (OSPF) Chapter VII: Layer 2 Switching Chapter VIII: Virtual LANs (VLANs) Chapter IX: Managing a Cisco Interwork Chapter X: Managing Traffic with Access Lists Chapter XI: Wide Area Networking Protocols
Platform: |
Size: 2190336 |
Author: 林长虹 |
Hits:
Description: 基于MATLAB的 Floyd最短路算法-MATLAB-based shortest path algorithm of Floyd
Platform: |
Size: 1024 |
Author: wxd |
Hits:
Description: 根据城市交通路网建设的实际, 研究了描述城市交通网络图的城市道路数据库的组织结构, 在此数据
结构的基础上依靠G IS 技术的支持, 采集了大量具体道路信息, 采用D ijk st ra 算法实现了快速最短路径搜索。根
据城市的交通状况对交通网络图的边值赋予不同的权值可实现最优路径搜寻, 给出了一个搜索实例——一个包
含61 个交通路口的最短路径搜索结果的搜索时间约为1. 1-Urban traffic network in accordance with the actual building, research describing the urban traffic of the urban road network structure of the database, in this data structure based on G IS techniques rely on the support, collecting a large number of specific road information, the use of D ijk st ra algorithm to achieve a fast shortest path search. According to city traffic conditions on the transport network map boundary value given different weights to achieve optimal path search, a search examples are given- one that contains 61 traffic junctions of the shortest path search results of the search time is about 1. 1
Platform: |
Size: 183296 |
Author: 王功臣 |
Hits:
Description: 遗传算法与蚁群算法演示程序~
城市间最短路径和曲线图-Genetic algorithm and ant colony algorithm demo program ~ the shortest path between cities and the curves
Platform: |
Size: 605184 |
Author: 王凤鸣 |
Hits:
Description: A*算法寻找最短路径，对此感兴趣的可以下载来看一下-A* algorithm to find the shortest path, which can be downloaded interested look
Platform: |
Size: 647168 |
Author: vccode |
Hits:
Description: kth算法的实现，可找出第k次最短路径，给出优化方案-KTH algorithm can find the first k-shortest path is given to optimize the program
Platform: |
Size: 12288 |
Author: gs_chen |
Hits:
Description: c#+arcengine实现最短路径分析-c#+ arcengine realize the shortest path analysis
Platform: |
Size: 2693120 |
Author: ilikegreentea |
Hits:
Description: 利用delphi和arcinfo数据格式实现最短路径查询-Use delphi and ArcInfo data formats to achieve the shortest path query
Platform: |
Size: 2048 |
Author: ilikegreentea |
Hits:
Description: OSPF是一种路由选择协议。路由选择算法和路由选择协议在概念上是不同的。网络上的主机、路由器通过路由选择算法形成路由表，以确定发送分组的传输路径。而路由选择协议是路由器用来建立路由表和更新路由信息的通信协议。
开放最短路径优先协议(Open Shortest Path First，OSPF)是目前最主要的内部网关协议之一。通过本课程设计，学生可以对路由表的建立和路由信息的更新等有更直观和清晰的认识。
-OSPF is a routing protocol. Routing algorithm and routing protocol in the concept is different. Network hosts, routers, routing algorithm, through the formation of routing table to determine the sending packet transmission path. The routing protocol is a router used to create routing tables and update the routing information of the communication protocol. Open Shortest Path First protocol (Open Shortest Path First, OSPF) is the most important one of the internal gateway protocol. Through the curriculum design, students can establish a routing table and routing information updates such as more intuitive and clear understanding.
Platform: |
Size: 1024 |
Author: 猪八戒 |
Hits:
Description: dijkstra算法实现，即最短寻路算法。给出图（有向图或者无向图）中各点间的权值。-Dijkstra algorithm, that is, find the shortest path algorithm. Given graph (directed graph or undirected graph) between various points in the right value.
Platform: |
Size: 1991680 |
Author: 宝宝 |
Hits:
Description: 初学A*算法的很好源码，基于最短路径规则-Novice A* algorithm is a good source, based on the shortest path rules
Platform: |
Size: 5120 |
Author: 杨羽 |
Hits:
Description: 单源最短路径问题：给定带权有向图G=(V,E)。给定V中的一个顶点v，称为源。要计算从源到所有其它各顶点的最短路径长度。-Single-source shortest path problem: a given weighted directed graph G = (V, E). Given a vertex V in v, known as the source. To calculate from the source to all other vertices of the shortest path length.
Platform: |
Size: 1024 |
Author: 忠波 |
Hits:
Description: 加权有向图的最短路径实现 Dijkstra算法-Weighted directed graph realize Dijkstra shortest path algorithm
Platform: |
Size: 243712 |
Author: CHENG |
Hits:
Description: c++开发最短路径，可用于地理信息系统专业-c++ development of the shortest path can be used to Geographic Information Systems Professional
Platform: |
Size: 168960 |
Author: 刘波 |
Hits:
Description: 最短路径floyd算法 数学建模 matlab-Floyd shortest path algorithm of mathematical modeling matlab
Platform: |
Size: 1650688 |
Author: hongbin |
Hits:
Description: Java 图算法, 包括最短路径, 有向图算法, 无向图算法, 网络流算法, 等-Java graph algorithm, including the shortest path algorithm for directed graph, undirected graph algorithms, network flow algorithms, such as
Platform: |
Size: 4379648 |
Author: 唐某某 |
Hits:
Description: 用c#写的最短路径算法，需要的可以参考一下-With c# Write the shortest path algorithm, needed for reference
Platform: |
Size: 100352 |
Author: jiadunxin |
Hits:
Description: 原创，A-star算法求解最短路径，寻路问题。
求解效率高，且对于理解A-Star算法和数据结构链表操作有非常有用。-Original, A-star algorithm for solving the shortest path routing problem. Solving high efficiency, and for understanding the A-Star algorithm and data structure linked list has a very useful operation.
Platform: |
Size: 2048 |
Author: lys |
Hits:
Description: dijkstra算法，可以求解图论中的两点间最短路径-Dijkstra algorithm, can solve the graph theory in the shortest path between two points
Platform: |
Size: 1024 |
Author: 晞睿 |
Hits:
Description: floyd，求最短路径的算法。。求任意两点间的最短距离-floyd, seeking the shortest path algorithms. . Arbitrary order of the shortest distance between two points
Platform: |
Size: 1024 |
Author: 吴帆 |
Hits:
«
1
2
3
45
6
7
8
9
10
...
50
»